A census of semisymmetric cubic graphs on up to 768 vertices
نویسندگان
چکیده
منابع مشابه
A census of semisymmetric cubic graphs on up to 768 vertices
A list is given of all semisymmetric (edgebut not vertex-transitive) connected finite cubic graphs of order up to 768. This list was determined by the authors using Goldschmidt’s classification of finite primitive amalgams of index (3, 3), and a computer algorithm for finding all normal subgroups of up to a given index in a finitely-presented group. The list includes several previously undiscov...
متن کاملCubic vertex-transitive graphs on up to 1280 vertices
A graph is called cubic and tetravalent if all of its vertices have valency 3 and 4, respectively. It is called vertex-transitive and arc-transitive if its automorphism group acts transitively on its vertex-set and on its arcset, respectively. In this paper, we combine some new theoretical results with computer calculations to construct all cubic vertex-transitive graphs of order at most 1280. ...
متن کاملSemisymmetric cubic graphs of twice odd order
Suppose that Γ is a connected graph and G is a subgroup of the automorphism group Aut(Γ) of Γ. Then Γ is G-symmetric if G acts transitively on the arcs (and so the vertices) of Γ and Γ is G-semisymmetric if G acts edge transitively but not vertex transitively on Γ. If Γ is Aut(Γ)symmetric, respectively, Aut(Γ)-semisymmetric, then we say that Γ is symmetric, respectively, semisymmetric. If Γ is ...
متن کاملCubic semisymmetric graphs of order 6p3
A regular graph is called semisymmetric if it is edge transitive but not vertex transitive It is proved that the Gray graph is the only cubic semisymmetric graph of order p where p is a prime
متن کاملCubic Semisymmetric Graphs of Order 2p 3 Semisymmetric Graphs of Order 2p 3
A regular graph is called semisymmetric if it is edge-transitive but not vertex-transitive. It is proved that the Gray graph is the only cubic semisymmetric graph of order 2p3, where p 3 is a prime.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebraic Combinatorics
سال: 2006
ISSN: 0925-9899,1572-9192
DOI: 10.1007/s10801-006-7397-3